Abstract Notions and Inference Systems for Proofs by Mathematical Induction

نویسندگان

  • Claus-Peter Wirth
  • Klaus Becker
چکیده

Notions and Inference Systems for Proofs by Mathematical Induction Claus-Peter Wirth? and Klaus Becker Fb. Informatik, Universität Kaiserslautern, D-67663, Germany {wirth, klbecker}@informatik.uni-kl.de Abstract. Soundness of inference systems for inductive proofs is sometimes Soundness of inference systems for inductive proofs is sometimes shown ad hoc and a posteriori, lacking modularization and interface notions. As a consequence, these soundness proofs tend to be clumsy, difficult to understand and maintain, and error prone with difficult to localize errors. Furthermore, common properties of the inference rules are often hidden, and the comparison with similar systems is difficult. To overcome these problems we propose to develop soundness proofs systematically by presenting an abstract frame inference system a priori and then to design each concrete inference rule locally as a sub-rule of some frame inference rule and to show its soundness by a small local proof establishing this sub-rule relationship. We present a frame inference system and two approaches to show its soundness, discuss an alternative, and briefly classify the literature. In an appendix we give an example and briefly discuss failure recognition and refutational completeness.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complementation: a bridge between finite and infinite proofs

When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof in a different inference system. In this paper, we show that, for some decidable inference systems, this (possibly) infinite proof has a representation as a...

متن کامل

Beluga: A Framework for Programming and Reasoning with Deductive Systems

Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototyping formal systems via higher-order abstract syntax. It also supports reasoning: the user implements inductive proofs about formal systems as dependently typed recursive functions. A distinctive feature of Beluga is th...

متن کامل

Programming Inductive Proofs - A New Approach Based on Contextual Types

In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inference rules within the logical framework LF. It also supports implementing proofs about formal systems as dependently typed recursive functions. What distinguishes Beluga from other frameworks is that it not only represe...

متن کامل

Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)

Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototyping formal systems via higher-order abstract syntax. It also supports reasoning: the user implements inductive proofs about formal systems as dependently typed recursive functions. A distinctive feature of Beluga is th...

متن کامل

Derivability and Admissibility of Inference Rules in Abstract Hilbert Systems

We give an overview of results, presented in the form of a poster at CSL03/KGC, about a general study of the notions of rule derivability and admissibility in Hilbert-style proof systems. The basis of our investigation consists in the concept of “abstract Hilbert system”, a framework for Hilbert-style proof systems in which it is abstracted from the syntax of formulas and the operational conten...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994